Handling Coordination in a Tree Adjoining Grammar
نویسندگان
چکیده
In this paper we show that an account for coordination can be constructed using the derivation structures in a lexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivation in LTAGs that preserves the notion of xed constituency in the LTAG lexicon while providing the exibility needed for coordination phenomena. We also discuss the construction of a practical parser for LTAGs that can handle coordination including cases of non-constituent coordination.
منابع مشابه
Handling Unlike Coordinated Phrases in TAG by Mixing Syntactic Category and Grammatical Function
Coordination of phrases of different syntactic categories has posed a problem for generative systems based only on syntactic categories. Although some prefer to treat them as exceptional cases that should require some extra mechanism (as for elliptical constructions), or to allow for unrestricted cross-category coordination, they can be naturally derived in a grammatic functional generative app...
متن کاملCoordination in Tree Adjoining Grammars: Formalization and Implementation
In this paper we show that an account for coordination can be constructed using the derivation structures in a lexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivation in LTAGs that preserves the notion of fixed constituency in the LTAG lexicon while providing the flexibility needed for coordination phenomena. We also discuss the construction of a practical parser for LTAGs ...
متن کاملKorean Grammar Using TAGs
This paper addresses various issues related to representing the Korean language using Tree Ad joining Grammars Topics covered include Korean grammar using TAGs Machine Translation between Korean and English using Synchronous Tree Adjoining Grammars STAGs handling scrambling using Multi Component TAGs MC TAGs and recovering empty arguments The data for the parsing is from US military telecommuni...
متن کاملTree Adjoining Grammars, Language Bias, and Genetic Programming
In this paper, we introduce a new grammar guided genetic programming system called tree-adjoining grammar guided genetic programming (TAG3P+), where tree-adjoining grammars (TAGs) are used as means to set language bias for genetic programming. We show that the capability of TAGs in handling context-sensitive information and categories can be useful to set a language bias that cannot be specifie...
متن کاملCoordination in TAG without the Conjoin Operation
In this paper, we propose an alternative to Sarkar and Joshi’s (1996) Conjoin Operation approach to clausal coordination with shared arguments. The Conjoin Operation applies across elementary trees, identifying and merging arguments from each clause, yielding a derivation tree in which the shared arguments are combined with multiple elementary trees, and a derived tree in which the shared argum...
متن کامل